Partial logics with two kinds of negation as a foundation for knowledge - based reasoning

نویسندگان

  • G. Wagner
  • Gerd Wagner
  • Jan Jaspars
چکیده

REPORTRAPPORT Partial logics with two kinds of negation as a foundation for knowledge-based reasoning Abstract We show how to use model classes of partial logic to deene semantics of general knowledge-based reasoning. Its essential beneet is that partial logics allow us to distinguish two sorts of negative information: the absence of information and the explicit rejection or falsiication of information. Another general advantage of partial logic, which we discuss in the rst part, is that its meta-theory is very close to the meta-theory of classical logic. In the second part notions of minimal, paraminimal and stable models are presented in terms of partial logic and we show how the resulting deenitions can be used to deene the semantics of knowledge bases such as relational and deductive databases, and extended logic programs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From Partial to Possibilistic Logic

Based on our earlier work on partial logics and extended logic programs [Wag91, Wag94, HJW96], and on the possibilistic logic of [DLP94], we de ne a compositional possibilistic rst-order logic with two kinds of negation.

متن کامل

Embedding negation as failure into minimal knowledge

Recent studies in nonmonotonic reasoning have shown that many of the best known nonmonotonic logics are based on the same two fundamental principles, i.e. minimal knowledge and negation as failure (or negation by default). In this paper we prove that it is possible to express negation as failure in terms of minimal knowledge. Specifically, we present a polynomial, non-faithful, modular embeddin...

متن کامل

Web Rules Need Two Kinds of Negation

In natural language, and in some knowledge representation systems, such as extended logic programs, there are two kinds of negation: a weak negation expressing non-truth, and a strong negation expressing explicit falsity. In this paper I argue that, like in several basic computational languages, such as OCL and SQL, two kinds of negation are also needed in the Semantic Web.

متن کامل

From Query Answering to Satissability in Nonmonotonic Logics

We propose a unifying view of negation as failure, integrity constraints, and epistemic queries in nonmonotonic reasoning. Specii-cally, we study the relationship between satis-ability and logical implication in nonmono-tonic logics, showing that, in many nonmono-tonic formalisms, it is possible and easy to reduce logical implication to satissability. This result not only allows for establishin...

متن کامل

A Faithful Integration of Description Logics with Logic Programming

Integrating description logics (DL) and logic programming (LP) would produce a very powerful and useful formalism. However, DLs and LP are based on quite different principles, so achieving a seamless integration is not trivial. In this paper, we introduce hybrid MKNF knowledge bases that faithfully integrate DLs with LP using the logic of Minimal Knowledge and Negation as Failure (MKNF) [Lifsch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995